Flow Networks and the Min-Cut-Max-Flow Theorem
نویسندگان
چکیده
We present a formalization of flow networks and the Min-Cut-MaxFlow theorem. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL— the interactive theorem prover used for the formalization.
منابع مشابه
A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks
Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by relevant classes, including small world topologies, which are pervasive in both man-made and natural networks, and wireless networks of dual devices, which expl...
متن کاملQuantum Max-flow/Min-cut
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. Although some aspects generalize , surprising counterexamples are found. We speculate that the phenomena revealed may be of interest in both spin systems in condensed matter and in quantum gravity.
متن کاملAn Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications
In this paper , we prove the first approximate max-flow min-cut theorem for undirected mul t i commodi ty flow. We show tha t for a feasible flow to exist in a mul t icommodi ty problem, it is sufficient t ha t every cut ' s capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all finite capacities and D is the sum of demands . Moreover, our theorem yields an a lgor i t...
متن کاملMax-flow min-cut theorem for Rényi entropy in communication networks
A symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms, was recently introduced. Many communication problems can be recast as dispersion problems in this setup. The so-called min-cut of a term set represents its number of degrees of freedom. For any assignment of function symbols, its dispersion measures the amount of in...
متن کاملThe Max-Flow Min-Cut theorem for countable networks
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not contain infinite trails then this flow can be chosen to be mundane, i.e. to be a sum of flows along finite pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017